Optimal Code and Data Layout in Embedded Systems
نویسندگان
چکیده
Efficient layout of code and data sections in various types/levels of memory in an embedded systems is very critical not only for achieving real-time performance, but also for reducing its cost and power consumption. In this paper we formulate the optimal code and data section layout problem as an integer linear programming (ILP) problem. The proposed formulation can handle: (i) on-chip and off-chip memory, (ii) multiple on-chip memory banks, (iii) single and dual ported on-chip RAMs, (iv) overlay of data sections, and (v) swapping of code and data (from/to external memory). Our experiments demonstrate that, for a moderately complex embedded system, the optimal results produced by our formulation took only a few minutes on a PC, and it matches, in terms of performance and on-chip memory size, with a hand-optimized code/data layout which took 1 manmonth.
منابع مشابه
Integrative Cell Formation and Layout Design in Cellular Manufacturing Systems
This paper proposes a new integrative view of manufacturing cell formation and both inter-cell and intra-cell layout problems. Cells formation and their popular bi-directional linear layout are determined simultaneously through a Dynamic Programming algorithm (with the objective of minimizing the inter-cell flow cost under a cell size constraint). This Dynamic Programming algorithm is implement...
متن کاملSide channel parameter characteristics of code injection attacks
Embedded systems are suggestive targets for code injection attacks in the recent years. Software protection mechanisms, and in general computers, are not usually applicable in embedded systems since they have limited resources like memory and process power. In this paper we investigate side channel characteristics of embedded systems and their applicability in code injection attack detection. T...
متن کاملA Continuous Plane Model to Machine Layout Problems Considering Pick-Up and Drop-Off Points: An Evolutionary Algorithm
One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...
متن کاملSecret Information Steganography Using LSB Insertion Methodwithout Bit Layout Section with Increasing Substitution Rate and High Reliability
In this paper, a faster method for embedding cryptographic information in the image ispresented by expressing the concept of latent prints (Steganography). Data is encrypted bytwo methods before embedding to increase reliability. Then they are embedded into the imageby a button, a method has been expressed to reduce potential noise impact on the wayinformation is encoded.
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کامل